Subgraph Isomorphism on Graph Classes that Exclude a Substructure
نویسندگان
چکیده
منابع مشابه
On Graph Isomorphism for Restricted Graph Classes
Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn’t be solved by classifying it as being either NP-complete or solvable in P. Nevertheless, efficient (polynomial-time or even NC) algorithms for restricted versions of GI have been found over the last four decades. Depending on the graph class, the design and analysis of algorithms for GI use tools f...
متن کاملSubgraph Isomorphism Search in Massive Graph Databases
Subgraph isomorphism search is a basic task in querying graph data. It consists to find all embeddings of a query graph in a data graph. It is encountered in many real world applications that require the management of structural data such as bioinformatics and chemistry. However, Subgraph isomorphism search is an NPcomplete problem which is prohibitively expensive in both memory and time in mas...
متن کاملOn Subgraph Isomorphism
Article explicitly expresses Subgraph Isomorphism by a polynomial size asymmetric linear system.
متن کاملSubgraph statistics in subcritical graph classes
Let H be a fixed graph and G a subcritical graph class. In this paper we show that the number of occurrences of H (as a subgraph) in a uniformly at random graph of size n in G follows a normal limiting distribution with linear expectation and variance. The main ingredient in our proof is the analytic framework developed by Drmota, Gittenberger and Morgenbesser to deal with infinite systems of f...
متن کاملTight Bounds for Graph Homomorphism and Subgraph Isomorphism
We prove that unless Exponential Time Hypothesis (ETH) fails, deciding if there is a homomorphism from graph G to graph H cannot be done in time |V (H)|o(|V (G)|). We also show an exponential-time reduction from Graph Homomorphism to Subgraph Isomorphism. This rules out (subject to ETH) a possibility of |V (H)|o(|V (H)|)-time algorithm deciding if graph G is a subgraph of H. For both problems o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2020
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-020-00737-z